Integrating Logic into Bayesian Networks Using Natural Deduction Proofs

ثبت نشده
چکیده

Natural deduction is a logical system that closely mimics the natural human reasoning process, using not axioms but rather assumptions that are made and later discharged when they are no longer needed. Logical proofs like these, however, lack the ability to handle varying levels of uncertainty and the contradictions that may arise when they are applied to real world situations. The goal of the study described in this paper was to develop a program to convert natural deduction proofs, to be supplied by an automatic theorem prover (ATP), into Bayesian networks, where probabilities can be easily and efficiently adjusted as evidence is found. Because ATPs generally work with resolution proofs, a new specification had to be developed for the input files. The networks were constructed by creating nodes for all formulas and their subformulas, except for context (assumption) nodes and quantifiers, which were handled separately. Ultimately, it is hoped that this conversion project will allow natural deduction to make use of large, existing probabilistic knowledge bases to better process incoming information, but such an objective is beyond the scope of this study.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deduction modulo theory

Contemporary proof theory goes into several directions at the same time. One of them aims at analysing proofs, propositions, connectives, etc., that is at decomposing these objects into more atomic ones. This often leads to design systems that are weaker than Predicate logic, but that have better algebraic or computational properties, and to try to reconstruct part of Predicate logic on top of ...

متن کامل

A Categorial Type Logic

In logical categorial grammar (Morrill 2011[22], Moot and Retoré 2012[10]) syntactic structures are categorial proofs and semantic structures are intuitionistic proofs, and the syntax-semantics interface comprises a homomorphism from syntactic proofs to semantic proofs. Thereby, logical categorial grammar embodies in a pure logical form the principles of compositionality, lexicalism, and parsin...

متن کامل

A Logic Program for Transforming Sequent Proofs to Natural Deduction Proofs

In this paper, we show that an intuitionistic logic with second-order function quantiication, called hh 2 here, can serve as a metalanguage to directly and naturally specify both sequent calculi and natural deduction inference systems for rst-order logic. For the intuitionistic subset of rst-order logic, we present a set of hh 2 formulas which simultaneously speciies both kinds of inference sys...

متن کامل

Presentation of proofs in modal natural deduction

We introduce a calculus for transforming first-order proofs of theorems originally formulated in modal logic, into modal natural deduction proofs. With a transformation procedure based on this calculus, we are able to present a proof in the language in which the problem was originally formulated, and in a formalism giving better insight into the contents of the proof. As a target language of th...

متن کامل

The geometry of non-distributive logics

In this paper we introduce a new natural deduction system for the logic of lattices, and a number of extensions of lattice logic with different negation connectives. We provide the class of natural deduction proofs with both a standard inductive definition and a global graph-theoretical criterion for correctness, and we show how normalisation in this system corresponds to cut elimination in the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007